A Trace Bound for Positive Definite Connected Integer Symmetric Matrices
نویسنده
چکیده
Let A be a connected integer symmetric matrix, i.e., A = (aij) ∈ Mn(Z) for some n, A = AT , and the underlying graph (vertices corresponding to rows, with vertex i joined to vertex j if aij 6= 0) is connected. We show that if all the eigenvalues of A are strictly positive, then tr(A) ≥ 2n− 1. There are two striking corollaries. First, the analogue of the Schur-SiegelSmyth trace problem is solved for characteristic polynomials of connected integer symmetric matrices. Second, we find new examples of totally real, separable, irreducible, monic integer polynomials that are not minimal polynomials of integer symmetric matrices.
منابع مشابه
Infinite-dimensional Log-Determinant divergences II: Alpha-Beta divergences
This work presents a parametrized family of divergences, namely Alpha-Beta LogDeterminant (Log-Det) divergences, between positive definite unitized trace class operators on a Hilbert space. This is a generalization of the Alpha-Beta Log-Determinant divergences between symmetric, positive definite matrices to the infinite-dimensional setting. The family of Alpha-Beta Log-Det divergences is highl...
متن کاملA Simple Approach to H-Infinity Analysis
We revisit the classical H∞ analysis problem of computing the `-induced norm of a linear time-invariant system. We follow an approach based on converting the problem of maximization over signals to that of maximization over a sort of deterministic covariance matrices. The reformulation in terms of these covariance matrices greatly simplifies the dynamic analysis problem and converts the computa...
متن کاملPower Indices of Trace Zero Symmetric Boolean Matrices
The power index of a square Boolean matrix A is the least integer d such that A is a linear combination of previous nonnegative powers of A. We determine the maximum power indices for the class of n × n primitive symmetric Boolean matrices of trace zero, the class of n × n irreducible nonprimitive symmetric Boolean matrices, and the class of n×n reducible symmetric Boolean matrices of trace zer...
متن کاملNovel Global Exponential Stability Criterion for Recurrent Neural Networks with Time-Varying Delay
and Applied Analysis 3 say, there is a parameter sequence (ρ 1 , . . . , ρ K ), which satisfies the following conditions: 0 < ρ 1 τ (t) < ρ2τ (t) < ⋅ ⋅ ⋅ < ρKτ (t) < τ (t) , 0 ≤ ρ i ̇ τ (t) ≤ ρiμ, (9) where ρ i ∈ (0, 1), i = 1, 2, . . . , K, K is positive integer. Utilizing the useful information ofK+1 dynamical subintervals, a novel LKF is constructed, and then a newly LMIbased delay-dependent ...
متن کاملDeep Manifold Learning of Symmetric Positive Definite Matrices with Application to Face Recognition
In this paper, we aim to construct a deep neural network which embeds high dimensional symmetric positive definite (SPD) matrices into a more discriminative low dimensional SPD manifold. To this end, we develop two types of basic layers: a 2D fully connected layer which reduces the dimensionality of the SPD matrices, and a symmetrically clean layer which achieves non-linear mapping. Specificall...
متن کامل